def Fac(num):
    if(num == 1):
        return 1;
    else:
        return num*Fac(num-1);

print(Fac(6));

# 斐波那契序列 1 1 2 3 5... 规则是 第三位数字永远等于前两位的相加之和
def Fib(num):
    if(num ==1):
        return 1;
    elif(num ==2):
        return 1;
    else:
        return Fib(num-1)+Fib(num-2);

print(Fib(6));